A Generalization of Gustafson-Kessel Algorithm using a New Constraint Parameter
نویسنده
چکیده
In this paper one presents a new fuzzy clustering algorithm based on a dissimilarity function determined by three parameters. This algorithm can be considered a generalization of the Gustafson-Kessel algorithm for fuzzy clustering.
منابع مشابه
Estimation of geochemical elements using a hybrid neural network-Gustafson-Kessel algorithm
Bearing in mind that lack of data is a common problem in the study of porphyry copper mining exploration, our goal was set to identify the hidden patterns within the data and to extend the information to the data-less areas. To do this, the combination of pattern recognition techniques has been used. In this work, multi-layer neural network was used to estimate the concentration of geochemical ...
متن کاملFuzzy Databases Using Extended Fuzzy C-Means Clustering
In recent years, the Fuzzy Relational Database and its queries have gradually become a new research topic. Fuzzy Structured Query Language (FSQL) is used to retrieve the data from fuzzy database because traditional Structured Query Language (SQL) is inefficient to handling uncertain and vague queries. The proposed model provides the facility for naïve users for retrieving relevant results of no...
متن کاملA Tunned-parameter Hybrid Algorithm for Dynamic Facility Layout Problem with Budget Constraint using GA and SAA
A facility layout problem is concerned with determining the best position of departments, cells, or machines on the plant. An efficient layout contributes to the overall efficiency of operations. It’s been proved that, when system characteristics change, it can cause a significant increase in material handling cost. Consequently, the efficiency of the current layout decreases or is lost and it ...
متن کاملE2GK: Evidential Evolving Gustafsson-Kessel Algorithm for Data Streams Partitioning Using Belief Functions
A new online clustering method, called E2GK (Evidential Evolving Gustafson-Kessel) is introduced in the theoretical framework of belief functions. The algorithm enables an online partitioning of data streams based on two existing and efficient algorithms: Evidantial cMeans (ECM) and Evolving Gustafson-Kessel (EGK). E2GK uses the concept of credal partition of ECM and adapts EGK, offering a bett...
متن کاملEvidential evolving Gustafson-Kessel algorithm for online data streams partitioning using belief function theory
A new online clustering method called E2GK (Evidential Evolving Gustafson-Kessel) is introduced. This partitional clustering algorithm is based on the concept of credal partition defined in the theoretical framework of belief functions. A credal partition is derived online by applying an algorithm resulting from the adaptation of the Evolving Gustafson-Kessel (EGK) algorithm. Online partitionin...
متن کامل